Some Generalities on Power Graphs and Strong Power Graphs
نویسنده
چکیده
The strong power graph G(G) of a group G with elements {1, 2, . . . , n} is a simple graph whose vertices being the elements of G and two distinct vertices i and j are adjacent in G(G) if im1 = jm2 for some positive integers m1,m2 < n. In this paper atfirst we define the strong power graphs and then study some of its properties. Further, we characterise power graphs and strong power graphs and study some parameters of both. Mathematics Subject Classification: 05C25
منابع مشابه
Two-geodesic transitive graphs of prime power order
In a non-complete graph $Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $uneq w$ and $u,w$ are not adjacent. The graph $Gamma$ is said to be $2$-geodesic transitive if its automorphism group is transitive on arcs, and also on 2-geodesics. We first produce a reduction theorem for the family of $2$-geodesic transitive graphs of prime power or...
متن کاملOn global (strong) defensive alliances in some product graphs
A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one moreneighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The global defensive alliance number of a graph $G$ is the minimum cardinality of a global defensive alliance in $G$. In this article we study the global ...
متن کاملOn the Regular Power Graph on the Conjugacy Classes of Finite Groups
emph{The (undirected) power graph on the conjugacy classes} $mathcal{P_C}(G)$ of a group $G$ is a simple graph in which the vertices are the conjugacy classes of $G$ and two distinct vertices $C$ and $C'$ are adjacent in $mathcal{P_C}(G)$ if one is a subset of a power of the other. In this paper, we describe groups whose associated graphs are $k$-regular for $k=5,6$.
متن کاملNew results on upper domatic number of graphs
For a graph $G = (V, E)$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_k}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i$ dominates $V_j$ or $V_j$ dominates $V_i$ or both for every $V_i, V_j in pi$, whenever $i neq j$. The textit{upper domatic number} $D(G)$ is the maximum order of an upper domatic partition. We study the properties of upper domatic number and propose an up...
متن کاملSome Applications of Strong Product
Let G and H be graphs. The strong product GH of graphs G and H is the graph with vertex set V(G)V(H) and u=(u1, v1) is adjacent with v= (u2, v2) whenever (v1 = v2 and u1 is adjacent with u2) or (u1 = u2 and v1 is adjacent with v2) or (u1 is adjacent with u2 and v1 is adjacent with v2). In this paper, we first collect the earlier results about strong product and then we present applications of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010